Heuristics and Performance Metamodels for the Dynamic Dial-a-Ride Problem

نویسنده

  • Ying Luo
چکیده

Title of dissertation: HEURISTICS AND PERFORMANCE METAMODELS FOR THE DYNAMIC DIAL-A-RIDE PROBLEM Ying Luo, Doctor of Philosophy, 2006 Directed by: Professor Paul M. Schonfeld Department of Civil and Environmental Engineering Explicit performance models of a transit system are often very useful in facilitating system design, optimization, alternative comparison, and gaining insights into the system relations. In this dissertation, three performance metamodels have been developed using the response surface metamodeling approach for the dynamic many-to-many dial-a-ride problem. The models predict, respectively, the minimum vehicle fleet size requirement, the average passenger time deviation from desired time, and the average passenger ride time ratio. The metamodeling approach incorporates in its simulation experiments a detailed vehicle routing algorithm and passenger time constraints, which are oversimplified or omitted by analytical approaches. A new rejected-reinsertion heuristic has been developed for the static dial-a-ride problem. The heuristic achieves vehicle reductions of up to 17% over the parallel insertion heuristic and of up to 12% over the regret insertion heuristic. The static heuristic has been extended to two online heuristics for the dynamic large-scale dial-a-ride problem, the immediate-insertion online heuristic and the rolling horizon online heuristic. The rolling horizon heuristic outperforms the immediate insertion heuristic by up to 10% vehicle reduction for demand scenario in which different demand lead times exist. Their computational efficiency makes them usable in real dynamic applications. The rolling horizon heuristic with an improvement procedure is employed in the simulation experiments upon which the metamodels are based. It is simple in concept, and it does not involve complex algorithm parameter calibration. The response surface methodology models the functional relation between an output of a process and its input factors through well designed experiments and statistical analysis. A face-centered central composite design is used in this study to determine the design points. Models are based on data collected from the simulation experiments and fitted using SPSS’s linear regression function. The metamodels are validated using an additional set of randomly generated data. The resulting models are relatively simple in structure, inexpensive to use and fairly robust. The applications of the performance models are illustrated through the parametric analysis and optimization of a dial-a-ride service considering the tradeoff between operator cost and user cost. HEURISTICS AND PERFORMANCE METAMODELS FOR THE DYNAMIC DIAL-A-RIDE PROBLEM

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

In the Dial-a-Ride Problem (DARP) users specify transportation requests between origins and destinations to be served by vehicles. In the Dynamic DARP, requests are received throughout the day and the primary objective is to accept as many requests as possible while satisfying operational constraints. This article describes and compares a number of parallel implementations of a tabu search heur...

متن کامل

A Distributed Approach for resolving a Stochastic Dial a Ride Problem with NSGA II

Transportation on demand does not stop facilitating our daily life. In fact, for 40 years the research has contributed to the resolution of the Dial a Ride Problem to improve the service offered to customers. In this research, we contributed to the resolution of a Stochastic Dial a Ride Problem while consider four problems that may inhibit the proper functioning of service Transport on Demand ,...

متن کامل

Applying Genetic Algorithms To The Dial-A-Ride Problem With Time Windows

The Dial-a-ride problem with time windows (DARPTW) assigns and schedules users transport requests to a fleet of vehicles enabled to fulfill the required service. The literature offers different heuristics for solving DARPTW problems, which are based on the extension of traditional graph search algorithms. On the other hand, the approach through Genetic Algorithms (GA) has been experienced in pr...

متن کامل

Improved Tabu Search Heuristics for Static Dial-A-Ride Problem: Faster and Better Convergence

Multi-vehicle routing has become increasingly important with the rapid development in autonomous vehicle technology. Dial-a-ride problem, a variant of vehicle routing problem (VRP), deals with the allocation of customer requests to vehicles, scheduling the pick-up and drop-off times and the sequence of serving those requests by ensuring high customer satisfaction with minimized travel cost. In ...

متن کامل

A tabu search heuristic for the static multi-vehicle dial-a-ride problem

This article describes a tabu search heuristic for the dial-a-ride problem with the following characteristics. Users specify transportation requests between origins and destinations. They may provide a time window on their desired departure or arrival time. Transportation is supplied by a fleet of vehicles based at a common depot. The aim is to design a set of least cost vehicle routes capable ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006